Polynomial Approximation in Lt , ( 0 < p < 1 )
نویسندگان
چکیده
We are interested in the approximation of functions f ~ Lp(I), 0 < p < 1, I = [ 1 , 1], by algebraic polynomials. Such approximation has previously been studied by other authors, most notably, Storozhenko, Krotov, and Oswald [-S-K-O] and Khodak [K]. Our main departure from these previous works is that we shall prove direct estimates for the error of polynomial approximation in terms of the Ditzian-Totik modulus of smoothness. This modulus measures smoothness differently at the endpoints of I than in the interior. Such dependence on the position of the point is crucial if we wish to characterize functions with a certain error of polynomial approximation (see [D-T]). We, however, do not in this paper discuss inverse estimates in terms of this modulus. A second variant of our work is to consider the approximation of monotone functions by monotone algebraic polynomials in Lp, 0 < p < 1. We establish the same estimates as for the unconstrained case but only for the firstand secondorder moduli. There is a result of Shvedov I-S] which says that such estimates cannot hold for smoothness order greater than 2. The usual estimates for approximating f ~ Lp(I) by algebraic polynomials are described in terms of the ordinary kth order modulus-of smoothness of f. If J is
منابع مشابه
On an Effective Variation of Kronecker's Approximation Theorem
Let Λ ⊂ Rn be an algebraic lattice, coming from a projective module over the ring of integers of a number field K. Let Z ⊂ Rn be the zero locus of a finite collection of polynomials such that Λ * Z or a finite union of proper full-rank sublattices of Λ. Let K1 be the number field generated over K by coordinates of vectors in Λ, and let L1, . . . , Lt be linear forms in n variables with algebrai...
متن کاملTitle : Level - Treewidth Property , Exact Algorithms and Approximation Schemes
Informally, a class of graphs G is said to have the level-treewidth property (LT-property) if for every G E G there is a layout (breadth first ordering) LG such that the subgraph induced by the vertices in k-consecutive levels in the layout have treewidth O ( f ( k ) ) , for some function f . We show that several important and well known classes of graphs including planar and bounded genus grap...
متن کاملA method to obtain the best uniform polynomial approximation for the family of rational function
In this article, by using Chebyshev’s polynomials and Chebyshev’s expansion, we obtain the best uniform polynomial approximation out of P2n to a class of rational functions of the form (ax2+c)-1 on any non symmetric interval [d,e]. Using the obtained approximation, we provide the best uniform polynomial approximation to a class of rational functions of the form (ax2+bx+c)-1 for both cases b2-4a...
متن کاملComonotone Polynomial Approximation in L_p[-1, 1], 0 < p ≤ ∞
Let a function f 2 L p ?1; 1], 0 < p 1 have 1 r < 1 changes of monotonicity. For all suuciently large n, we construct algebraic polynomials p n of degree n which are comonotone with f, and such that kf ? p n k Lp?1; 1] C(r)! ' 2 (f; n ?1) p , where ! ' 2 (f; n ?1) p denotes the Ditzian-Totik second modulus of smoothness in L p metric.
متن کاملA Numerical Approach for Fractional Optimal Control Problems by Using Ritz Approximation
In this article, Ritz approximation have been employed to obtain the numerical solutions of a class of the fractional optimal control problems based on the Caputo fractional derivative. Using polynomial basis functions, we obtain a system of nonlinear algebraic equations. This nonlinear system of equation is solved and the coefficients of basis polynomial are derived. The convergence of the num...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005